Piotr Indyk - PDFSEARCH.IO - Document Search Engine

Piotr Indyk
Results: 118

#	Item
81	References for the “Algorithmic High Dimensional Geometry” lectures at the Big Data Boot Camp, Simons Institute, Berkeley Alexandr Andoni Microsoft Research SVC September 4, 2013 Add to Reading List Source URL: www.mit.edu Language: English - Date: 2013-09-12 03:13:30 Year of birth missing Discrete geometry Symposium on Foundations of Computer Science Symposium on Theory of Computing Piotr Indyk Machine learning Kenneth L. Clarkson Computational geometry Streaming algorithm Mathematics Geometry Theoretical computer science
82	Tutorial: Sparse Recovery Using Sparse Matrices Piotr Indyk MIT Problem Formulation Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-09-23 17:45:35 Integer sequences Number theory Factorial Matrix Digital signal processing Fourier analysis Mathematics Mathematical analysis Combinatorics
83	Matrix multiplication and pattern matching under Hamming norm Rapha¨el Clifford January 23, 2009 Abstract My understanding of a conversation with Ely Porat who in turn attributes Piotr Indyk. Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:10 Coding theory Error detection and correction Matrices Computer arithmetic Numerical linear algebra Matrix Logical matrix Hamming Closest string Algebra Mathematics Linear algebra
84	Sparse Recovery Using Sparse (Random) Matrices Piotr Indyk MIT Joint work with: Radu Berinde, Anna Gilbert, Howard Karloff, Martin Strauss and Milan Ruzic Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-01-21 23:26:36 Matrix Numerical linear algebra
85	1 Introduction Gregory Shakhnarovich, Piotr Indyk, and Trevor Darrell The nearest-neighbor (NN) problem occurs in the literature under many Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2006-03-03 12:41:25 Artificial intelligence Nearest neighbor search Locality-sensitive hashing K-nearest neighbor algorithm K-d tree Voronoi diagram Shape context Computational geometry Algorithm Information science Search algorithms Mathematics
86	Sample-Optimal Fourier Sampling in Any Constant Dimension Piotr Indyk Michael Kapralov August 2, 2014 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-30 11:14:06 Fourier analysis Digital signal processing Joseph Fourier Unitary operators Analysis of algorithms Discrete Fourier transform Fast Fourier transform Fourier transform Fourier series Mathematical analysis Mathematics Theoretical computer science
87	Similarity Search in High Dimensions II Piotr Indyk MIT Approximate Near(est) Neighbor Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2011-08-18 19:22:52 Mathematics Nearest neighbor search K-nearest neighbor algorithm Information science Search algorithms Information retrieval
88	1 Sparse Recovery Using Sparse Matrices Anna Gilbert, Piotr Indyk Abstract—We survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-05-15 17:43:14 Numerical linear algebra Matrix theory Sparse matrix Matrix Sparse approximation Belief propagation Eigenvalues and eigenvectors Time complexity Algebra Mathematics Linear algebra
89	Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-02-23 00:05:29 Applied mathematics Computational complexity theory Algorithms Streaming algorithm Ε-net Approximation algorithms Computational geometry Mathematics
90	Alexandr Andoni http://www.mit.edu/~andoni Email: Phone: Experience Add to Reading List Source URL: www.mit.edu Language: English - Date: 2015-02-05 02:44:09 Year of birth missing Symposium on Foundations of Computer Science Symposium on Theory of Computing Piotr Indyk International Colloquium on Automata Languages and Programming Streaming algorithm Ravi Kannan Nearest neighbor search ACM SIGACT Theoretical computer science Applied mathematics Mathematics

UPDATE